Minimal sumsets in finite solvable groups

finite bci-groups are solvable

‎let $s$ be a subset of a finite group $g$‎. ‎the bi-cayley graph ${rm bcay}(g,s)$ of $g$ with respect to $s$ is an undirected graph with vertex set $gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid xin g‎, ‎ sin s}$‎. ‎a bi-cayley graph ${rm bcay}(g,s)$ is called a bci-graph if for any bi-cayley graph ${rm bcay}(g,t)$‎, ‎whenever ${rm bcay}(g,s)cong {rm bcay}(g,t)$ we have $t=gs^alpha$ for some $...

Solvable groups definable in o-minimal structures

Let N be an o-minimal structure. In this paper we develop group extension theory over N and use it to describe N -definable solvable groups. We prove an o-minimal analogue of the Lie-Kolchin-Mal’cev theorem and we describe N -definable G-modules and N -definable

On two questions about restricted sumsets in finite abelian groups

Let G be an abelian group of finite order n, and let h be a positive integer. A subset A of G is called weakly h-incomplete if not every element of G can be written as the sum of h distinct elements of A; in particular, if A does not contain h distinct elements that add to zero, then A is called weakly h-zero-sum-free. We investigate the maximum size of weakly hincomplete and weakly h-zero-sum-...

Sumsets in dihedral groups

Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG (r, s), where G is any abelian ...

Engel-like Identities Characterizing Finite Solvable Groups